By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.
Table of Contents
Search This Issue
Volume 18, Issue 4, pp. 663-878

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Combinatorial Constructions for Optimal Splitting Authentication Codes

Gennian Ge, Ying Miao, and Lihua Wang

pp. 663-678

BibTeX  Abstract Full Text:  PDF

Lower Bounds from Tile Covers for the Channel Assignment Problem

J. C. M. Janssen, T. E. Wentzell, and S. L. Fitzpatrick

pp. 679-696

BibTeX  Abstract Full Text:  PDF

Learning a Hidden Subgraph

Noga Alon and Vera Asodi

pp. 697-712

BibTeX  Abstract Full Text:  PDF

Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices

Peter Keevash and Benny Sudakov

pp. 713-727

BibTeX  Abstract Full Text:  PDF

The Cover Time of Random Regular Graphs

Colin Cooper and Alan Frieze

pp. 728-740

BibTeX  Abstract Full Text:  PDF

A Recursive Construction For Regular Difference Triangle Sets

Wensong Chu, Charles J. Colbourn, and Solomon W. Golomb

pp. 741-748

BibTeX  Abstract Full Text:  PDF

On Identifying Maximal Covers

S. Muñoz

pp. 749-768

BibTeX  Abstract Full Text:  PDF

Minimal-Time k-Line Broadcasting

I. Gaber

pp. 769-777

BibTeX  Abstract Full Text:  PDF

Hypercubes As Direct Products

Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, and Blaz Zmazek

pp. 778-786

BibTeX  Abstract Full Text:  PDF

Small Contingency Tables with Large Gaps

Seth Sullivant

pp. 787-793

BibTeX  Abstract Full Text:  PDF

On the Behavior of a Family of Meta-Fibonacci Sequences

Joseph Callaghan, John J. Chew, III, and Stephen M. Tanny

pp. 794-824

BibTeX  Abstract Full Text:  PDF

On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes

Tero Laihonen

pp. 825-834

BibTeX  Abstract Full Text:  PDF

Four Characters Suffice to Convexly Define a Phylogenetic Tree

Katharina T. Huber, Vincent Moulton, and Mike Steel

pp. 835-843

BibTeX  Abstract Full Text:  PDF

On the Optimality of Coloring with a Lattice

Yael Ben-Haim and Tuvi Etzion

pp. 844-878

BibTeX  Abstract Full Text:  PDF